The Riis Complexity Gap for QBF Resolution

We give an analogue of the Riis Complexity Gap Theorem for Quantified Boolean Formulas (QBFs). Every first-order sentence φ without finite models gives rise to a sequence of QBFs whose minimal refutations in tree-like QResolution are either of polynomial size (if φ has no models) or at least exponential in size (if φ has some infinite model). However, differently from the translations to propositional logic, the translation to QBF must be given additional structure in order for the polynomial upper bound to hold in treelike Q-Resolution. This extra structure is not needed in the system tree-like ∀Exp+Res, where we see the complexity gap on a natural translation to QBF.